Clustering analysis application on Industry 4.0-driven global indexes
نویسندگان
چکیده
منابع مشابه
Towards a Semantic Web Application: Ontology-Driven Ortholog Clustering Analysis
Ontology is the foundation of Semantic Web applications. The Clusters of Orthologous Groups (COG) system uses evolutionary relationships to cluster proteins from different genomes into different functional categories. In this study, we generated a COG Analysis Ontology (CAO), and used it to develop OntoCOG, an ontology-based Semantic Web application for COG-based gene set enrichment analysis. A...
متن کاملImpact of Multi-level Clustering on Performance Driven Global Placement
Delay and wirelength minimization continue to be important objectives in the design of high-performance computing systems. For large-scale circuits, the clustering process becomes essential for reducing the problem size. However, to the best of our knowledge, there is no study about the impact of multi-level clustering on performancedriven global placement. In this paper, five clustering algori...
متن کاملGlobal Forum on Industry
The views and comments contained in this study are those of the authors and do not necessarily reflect those of the United Nations Industrial Development Organization (UNIDO) nor do they officially commit UNIDO to any particular course of action. The designations employed and the presentation of material in this document do not imply the expression of any opinion whatsoever on the part of the S...
متن کاملTop-down Clustering Using Multidimensional Indexes
Clustering on large databases has been studied actively as an increasing number of applications involve huge amount of data. In this paper, we propose a novel top-down clustering method based on region density using a multidimensional index. Generally, multidimensional indexes have the clustering property of storing similar objects in the same or adjacent data pages. By taking advantage of this...
متن کاملEstimating Clustering Indexes in Data Streams
We present random sampling algorithms that with probability at least 1 − δ compute a (1 ± )approximation of the clustering coefficient and of the number of bipartite clique subgraphs of a graph given as an incidence stream of edges. The space used by our algorithm to estimate the clustering coefficient is inversely related to the clustering coefficient of the network itself. The space used by o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2019
ISSN: 1877-0509
DOI: 10.1016/j.procs.2019.09.037